Feature Oriented Progressive Lossless Mesh Coding

نویسندگان

  • Jingliang Peng
  • Yan Huang
  • C.-C. Jay Kuo
  • Ilya Eckstein
  • Meenakshisundaram Gopi
چکیده

A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequence of levels of detail (LODs) are generated through iterative vertex set split and bounding volume subdivision. The incremental geometry and connectivity updates associated with each vertex set split and/or bounding volume subdivision are entropy coded. Due to the visual importance of sharp geometric features, the whole geometry coding process is optimized for a better presentation of geometric features, especially at low coding bitrates. Feature-oriented optimization in FOLProM is performed in hierarchy control and adaptive quantization. Efficient coordinate representation and prediction schemes are employed to reduce the entropy of data significantly. Furthermore, a simple yet efficient connectivity coding scheme is proposed. It is shown that FOLProM offers a significant rate-distortion (R-D) gain over the prior art, which is especially obvious at low bitrates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

POMAR: Compression of progressive oriented meshes accessible randomly

This paper presents a new random accessible and progressive lossless manifold triangle mesh compression algorithm named POMAR. It allows to extract different parts of the input mesh at different levels of detail during the decompression. A smooth transition without artefacts is generated between adjacent regions decompressed at different levels of detail. Our approach allows selective decompres...

متن کامل

Notice of the Final Oral Examination for the Degree of Master of Applied Science

A new progressive lossy-to-lossless coding framework for 2.5-dimensional (2.5-D) triangle meshes with arbitrary connectivity is proposed by combining ideas from the previously proposed average-difference image-tree (ADIT) method and the Peng-Kuo (PK) method with several modifications. The proposed method represents the 2.5-D triangle mesh with a binary tree data structure, and codes the tree by...

متن کامل

Lossless coding for progressive archival of multispectral images

In this paper, a nonlinear subband decomposition scheme with perfect reconstruction is proposed for lossless coding of multispectral images. The merit of this new scheme is to exploit efficiently both the spatial and the spectral redundancies contained in a multispectral image sequence. Besides, it is suitable for progressive coding, which constitutes a desirable feature for telebrowsing applic...

متن کامل

Fully Embedded Coding of Triangle Meshes

An algorithm for triangle mesh compression is presented. Any mesh topology can be coded. Vertex coordinates and mesh connectivity are simultaneously coded with increasing level-ofdetail. The bit stream can be sequentially decoded and vertex accuracy and mesh resolution gradually re ned. The embedded code allows progressive transmission of triangle meshes and continuous decoding of 3D geometry. ...

متن کامل

State of the art: Compression of 3D meshes

The three-dimensional mesh compression has increasingly been a vital subject matter for years and has had a rich state of the art. Therefore, it is selected to be the cornerstone of this article. As a matter of fact, we began with the mono-resolution compression methods; then, we moved to the progressive methods and, at last, to the methods based on multi-resolution analysis. Now, we can distin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2010